0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.34	% Computer   : n015.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 13:53:34 EDT 2021
0.19/0.34	% CPUTime    : 
0.19/0.34	% Number of cores: 8
0.19/0.35	% Python version: Python 3.6.8
0.19/0.35	# Version: 2.6rc1-ho
0.19/0.35	# No SInE strategy applied
0.19/0.35	# Trying AutoSched0 for 59 seconds
0.20/0.38	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S024I
0.20/0.38	# and selection function SelectOptimalRestrPDepth2.
0.20/0.38	#
0.20/0.38	# Preprocessing time       : 0.030 s
0.20/0.38	# Presaturation interreduction done
0.20/0.38	
0.20/0.38	# Proof found!
0.20/0.38	# SZS status Theorem
0.20/0.38	# SZS output start CNFRefutation
0.20/0.38	thf(iffalse, conjecture, ((ifSingleton=>(![X1:$i, X2:$o, X3:$i]:(in @ X3 @ X1=>![X4:$i]:(((if @ X1 @ (X2) @ X3 @ X4)=(X4)<=~(X2))<=in @ X4 @ X1))<=theeq))<=iffalseProp1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', iffalse)).
0.20/0.38	thf(iffalseProp1, axiom, (iffalseProp1<=>![X1:$i, X2:$o, X3:$i]:(in @ X3 @ X1=>![X4:$i]:(in @ X4 @ X1=>(~(X2)=>in @ X4 @ (dsetconstr @ X1 @ (^[X5:$i]:((X2&(X5)=(X3))|(~(X2)&(X5)=(X4))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', iffalseProp1)).
0.20/0.38	thf(ifSingleton, axiom, (ifSingleton<=>![X1:$i, X2:$o, X3:$i]:(in @ X3 @ X1=>![X4:$i]:(in @ X4 @ X1=>singleton @ (dsetconstr @ X1 @ (^[X5:$i]:((X2&(X5)=(X3))|(~(X2)&(X5)=(X4)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ifSingleton)).
0.20/0.38	thf(theeq, axiom, (theeq<=>![X6:$i]:(singleton @ X6=>![X3:$i]:(in @ X3 @ X6=>(setunion @ X6)=(X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', theeq)).
0.20/0.38	thf(if, axiom, (if)=(^[X1:$i, X2:$o, X3:$i, X4:$i]:setunion @ (dsetconstr @ X1 @ (^[X5:$i]:((X2&(X5)=(X3))|(~(X2)&(X5)=(X4)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', if)).
0.20/0.38	thf(c_0_5, plain, ![X21:$i, X2:$o, X3:$i, X4:$i]:(epred1_4 @ X4 @ X3 @ X2 @ X21<=>((X2&(X21)=(X3))|(~X2&(X21)=(X4)))), inference(fof_simplification,[status(thm)],[introduced(definition)])).
0.20/0.38	thf(c_0_6, negated_conjecture, ~((![X1:$i, X2:$o, X3:$i]:(in @ X3 @ X1=>![X4:$i]:(in @ X4 @ X1=>(~X2=>in @ X4 @ (dsetconstr @ X1 @ (epred1_4 @ X4 @ X3 @ X2)))))=>(![X1:$i, X2:$o, X3:$i]:(in @ X3 @ X1=>![X4:$i]:(in @ X4 @ X1=>singleton @ (dsetconstr @ X1 @ (epred1_4 @ X4 @ X3 @ X2))))=>(![X6:$i]:(singleton @ X6=>![X3:$i]:(in @ X3 @ X6=>(setunion @ X6)=(X3)))=>![X1:$i, X2:$o, X3:$i]:(in @ X3 @ X1=>![X4:$i]:(in @ X4 @ X1=>(~X2=>((~X2|(if @ X1 @ $true @ X3 @ X4)=(X4))&(X2|(if @ X1 @ $false @ X3 @ X4)=(X4)))))))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[iffalse]), iffalseProp1]), ifSingleton]), theeq]), c_0_5]), c_0_5])])])).
0.20/0.38	thf(c_0_7, negated_conjecture, ![X26:$i, X27:$o, X28:$i, X29:$i, X30:$i, X31:$o, X32:$i, X33:$i, X34:$i, X35:$i]:((~in @ X28 @ X26|(~in @ X29 @ X26|(X27|in @ X29 @ (dsetconstr @ X26 @ (epred1_4 @ X29 @ X28 @ X27)))))&((~in @ X32 @ X30|(~in @ X33 @ X30|singleton @ (dsetconstr @ X30 @ (epred1_4 @ X33 @ X32 @ X31))))&((~singleton @ X34|(~in @ X35 @ X34|(setunion @ X34)=(X35)))&(in @ esk2_0 @ esk1_0&(in @ esk3_0 @ esk1_0&(~epred2_0&(((~epred2_0|epred2_0)&((if @ esk1_0 @ $false @ esk2_0 @ esk3_0)!=(esk3_0)|epred2_0))&((~epred2_0|(if @ esk1_0 @ $true @ esk2_0 @ esk3_0)!=(esk3_0))&((if @ esk1_0 @ $false @ esk2_0 @ esk3_0)!=(esk3_0)|(if @ esk1_0 @ $true @ esk2_0 @ esk3_0)!=(esk3_0)))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])).
0.20/0.38	thf(c_0_8, negated_conjecture, ![X1:$i, X2:$o, X4:$i, X3:$i]:(singleton @ (dsetconstr @ X3 @ (epred1_4 @ X4 @ X1 @ X2))|~in @ X1 @ X3|~in @ X4 @ X3), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.38	thf(c_0_9, negated_conjecture, in @ esk3_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.38	thf(c_0_10, plain, ![X1:$i, X2:$o, X3:$i, X4:$i]:(if @ X1 @ X2 @ X3 @ X4)=(setunion @ (dsetconstr @ X1 @ (epred1_4 @ X4 @ X3 @ X2))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[if]), c_0_5])).
0.20/0.38	thf(c_0_11, negated_conjecture, ![X2:$o, X1:$i]:(singleton @ (dsetconstr @ esk1_0 @ (epred1_4 @ esk3_0 @ X1 @ X2))|~in @ X1 @ esk1_0), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.20/0.38	thf(c_0_12, negated_conjecture, in @ esk2_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.38	thf(c_0_13, plain, ![X22:$i, X23:$o, X24:$i, X25:$i]:(if @ X22 @ X23 @ X24 @ X25)=(setunion @ (dsetconstr @ X22 @ (epred1_4 @ X25 @ X24 @ X23))), inference(variable_rename,[status(thm)],[c_0_10])).
0.20/0.38	thf(c_0_14, negated_conjecture, ![X1:$i, X4:$i, X3:$i]:(in @ X4 @ (dsetconstr @ X3 @ (epred1_4 @ X4 @ X1 @ $false))|~in @ X1 @ X3|~in @ X4 @ X3), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7])])])).
0.20/0.38	thf(c_0_15, negated_conjecture, ![X3:$i, X1:$i]:((setunion @ X1)=(X3)|~singleton @ X1|~in @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.38	thf(c_0_16, negated_conjecture, ![X2:$o]:singleton @ (dsetconstr @ esk1_0 @ (epred1_4 @ esk3_0 @ esk2_0 @ X2)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.20/0.38	thf(c_0_17, plain, ![X1:$i, X4:$i, X3:$i, X2:$o]:(if @ X1 @ X2 @ X3 @ X4)=(setunion @ (dsetconstr @ X1 @ (epred1_4 @ X4 @ X3 @ X2))), inference(split_conjunct,[status(thm)],[c_0_13])).
0.20/0.38	thf(c_0_18, negated_conjecture, ![X1:$i]:(in @ esk3_0 @ (dsetconstr @ esk1_0 @ (epred1_4 @ esk3_0 @ X1 @ $false))|~in @ X1 @ esk1_0), inference(spm,[status(thm)],[c_0_14, c_0_9])).
0.20/0.38	thf(c_0_19, negated_conjecture, (epred2_0|(if @ esk1_0 @ $false @ esk2_0 @ esk3_0)!=(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.38	thf(c_0_20, negated_conjecture, ~epred2_0, inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.38	thf(c_0_21, negated_conjecture, ![X1:$i, X2:$o]:((if @ esk1_0 @ X2 @ esk2_0 @ esk3_0)=(X1)|~in @ X1 @ (dsetconstr @ esk1_0 @ (epred1_4 @ esk3_0 @ esk2_0 @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
0.20/0.38	thf(c_0_22, negated_conjecture, in @ esk3_0 @ (dsetconstr @ esk1_0 @ (epred1_4 @ esk3_0 @ esk2_0 @ $false)), inference(spm,[status(thm)],[c_0_18, c_0_12])).
0.20/0.38	thf(c_0_23, negated_conjecture, (if @ esk1_0 @ $false @ esk2_0 @ esk3_0)!=(esk3_0), inference(sr,[status(thm)],[c_0_19, c_0_20])).
0.20/0.38	thf(c_0_24, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), ['proof']).
0.20/0.38	# SZS output end CNFRefutation
0.20/0.38	# Proof object total steps             : 25
0.20/0.38	# Proof object clause steps            : 15
0.20/0.38	# Proof object formula steps           : 10
0.20/0.38	# Proof object conjectures             : 17
0.20/0.38	# Proof object clause conjectures      : 14
0.20/0.38	# Proof object formula conjectures     : 3
0.20/0.38	# Proof object initial clauses used    : 8
0.20/0.38	# Proof object initial formulas used   : 5
0.20/0.38	# Proof object generating inferences   : 6
0.20/0.38	# Proof object simplifying inferences  : 4
0.20/0.38	# Training examples: 0 positive, 0 negative
0.20/0.38	# Parsed axioms                        : 13
0.20/0.38	# Removed by relevancy pruning/SinE    : 0
0.20/0.38	# Initial clauses                      : 25
0.20/0.38	# Removed in clause preprocessing      : 10
0.20/0.38	# Initial clauses in saturation        : 15
0.20/0.38	# Processed clauses                    : 43
0.20/0.38	# ...of these trivial                  : 0
0.20/0.38	# ...subsumed                          : 2
0.20/0.38	# ...remaining for further processing  : 41
0.20/0.38	# Other redundant clauses eliminated   : 2
0.20/0.38	# Clauses deleted for lack of memory   : 0
0.20/0.38	# Backward-subsumed                    : 0
0.20/0.38	# Backward-rewritten                   : 0
0.20/0.38	# Generated clauses                    : 24
0.20/0.38	# ...of the previous two non-trivial   : 23
0.20/0.38	# Contextual simplify-reflections      : 0
0.20/0.38	# Paramodulations                      : 22
0.20/0.38	# Factorizations                       : 0
0.20/0.38	# NegExts                              : 0
0.20/0.38	# Equation resolutions                 : 2
0.20/0.38	# Propositional unsat checks           : 0
0.20/0.38	#    Propositional check models        : 0
0.20/0.38	#    Propositional check unsatisfiable : 0
0.20/0.38	#    Propositional clauses             : 0
0.20/0.38	#    Propositional clauses after purity: 0
0.20/0.38	#    Propositional unsat core size     : 0
0.20/0.38	#    Propositional preprocessing time  : 0.000
0.20/0.38	#    Propositional encoding time       : 0.000
0.20/0.38	#    Propositional solver time         : 0.000
0.20/0.38	#    Success case prop preproc time    : 0.000
0.20/0.38	#    Success case prop encoding time   : 0.000
0.20/0.38	#    Success case prop solver time     : 0.000
0.20/0.38	# Current number of processed clauses  : 26
0.20/0.38	#    Positive orientable unit clauses  : 12
0.20/0.38	#    Positive unorientable unit clauses: 0
0.20/0.38	#    Negative unit clauses             : 2
0.20/0.38	#    Non-unit-clauses                  : 12
0.20/0.38	# Current number of unprocessed clauses: 8
0.20/0.38	# ...number of literals in the above   : 14
0.20/0.38	# Current number of archived formulas  : 0
0.20/0.38	# Current number of archived clauses   : 13
0.20/0.38	# Clause-clause subsumption calls (NU) : 10
0.20/0.38	# Rec. Clause-clause subsumption calls : 10
0.20/0.38	# Non-unit clause-clause subsumptions  : 0
0.20/0.38	# Unit Clause-clause subsumption calls : 17
0.20/0.38	# Rewrite failures with RHS unbound    : 0
0.20/0.38	# BW rewrite match attempts            : 21
0.20/0.38	# BW rewrite match successes           : 0
0.20/0.38	# Condensation attempts                : 0
0.20/0.38	# Condensation successes               : 0
0.20/0.38	# Termbank termtop insertions          : 2030
0.20/0.38	
0.20/0.38	# -------------------------------------------------
0.20/0.38	# User time                : 0.032 s
0.20/0.38	# System time              : 0.003 s
0.20/0.38	# Total time               : 0.035 s
0.20/0.38	# Maximum resident set size: 1640 pages
0.20/0.38	EOF